3-Coloring in Time O(1.3446n): A No-MIS Algorithm
نویسندگان
چکیده
We consider worst case time bounds for NP-complete problems including 3-SAT, 3-coloring, 3-edge-coloring, and 3-list-coloring. Our algorithms are based on a common generalization of these problems, called symbol-system satissability or, brieey, SSS 1]. 3-SAT is equivalent to (2,3)-SSS while the other problems above are special cases of (3,2)-SSS; there is also a natural duality transformation from (a; b)-SSS to (b; a)-SSS. We give a fast algorithm for (3,2)-SSS and use it to improve the time bounds for solving the other problems listed above.
منابع مشابه
Distributed Symmetry Breaking in Hypergraphs
Fundamental local symmetry breaking problems such as Maximal Independent Set (MIS) and coloring have been recognized as important by the community, and studied extensively in (standard) graphs. In particular, fast (i.e., logarithmic run time) randomized algorithms are well-established for MIS and ∆ + 1-coloring in both the LOCAL and CONGEST distributed computing models. On the other hand, compa...
متن کاملSymmetry breaking depending on the chromatic number or the neighborhood growth
Wedeterministically compute a∆+1 coloring and amaximal independent set(MIS) in time O(∆1/2+Θ(1/ √ h) + log n) for∆1+i ≤ ∆1+i/h, where∆j is defined as themaximal number of nodes within distance j for a node and ∆ := ∆1. Our greedy coloring and MIS algorithms improve the state-of-the-art algorithms running inO(∆+ log n) for a large class of graphs, i.e., graphs of (moderate) neighborhood growth w...
متن کاملApproximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs
A box graph is the intersection graph of a finite set of orthogonal rectangles in the plane. The problem of whether or not the maximum independent set problem (MIS for short) for box graphs can be approximated within a substantially sub-logarithmic factor in polynomial time has been open for several years. We show that for box graphs on n vertices which have an independent set of size Ω(n/ log ...
متن کاملArbitrary Transmission Power in the SINR Model: Local Broadcasting, Coloring and MIS
Both in the light of energy conservation and the expansion of existing networks, wireless networks face the challenge of nodes with heterogeneous transmission power. However, for more realistic models of wireless communication only few algorithmic results are known. In this paper we consider nodes with arbitrary power assignment in the so-called physical or SINR model. Our first result is a bou...
متن کاملA practical algorithm for [r, s, t]-coloring of graph
Coloring graphs is one of important and frequently used topics in diverse sciences. In the majority of the articles, it is intended to find a proper bound for vertex coloring, edge coloring or total coloring in the graph. Although it is important to find a proper algorithm for graph coloring, it is hard and time-consuming too. In this paper, a new algorithm for vertex coloring, edge coloring an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 2 شماره
صفحات -
تاریخ انتشار 1995